A Formalization of a Concurrent Object Calculus up to -conversion

We experiment a method for representing a concurrent object calculus in the Calculus of Inductive Constructions. Terms are rst deened in de Bruijn style, then names are reintroduced in binders. The terms of the calculus are formalized in the mechanized logic by suitable subsets of the de Bruijn terms; namely those whose de Bruijn indices are relayed beyond the scene. The-equivalence relation is the Leibnitz equality and the substitution functions can de deened as sets of partial rewriting rules on these terms. We prove induction schemes for both the terms and some properties of the calculus which internalize the renaming of bound variables. We show that, despite that the terms which formalize the calculus are not generated by a last xed point relation, we can prove the desire inversion lemmas. We formalize the computational part of the semantic and a simple type system of the calculus. At least, we prove a subject reduction theorem and see that the speciica-tions and proofs have the nice feature of not mixing de Bruijn technical manipulations with real proofs.